Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs
نویسندگان
چکیده
منابع مشابه
A census of 4-valent half-arc-transitive graphs and arc- transitive digraphs of valence two
A complete list of all connected arc-transitive asymmetric digraphs of in-valence and out-valence 2 on up to 1000 vertices is presented. As a byproduct, a complete list of all connected 4-valent graphs admitting a 12 -arc-transitive group of automorphisms on up to 1000 vertices is obtained. Several graph-theoretical properties of the elements of our census are calculated and discussed.
متن کاملBounding the size of a vertex-stabiliser in a finite vertex-transitive graph
In this paper we discuss a method for bounding the size of the stabiliser of a vertex in a G-vertex-transitive graph Γ. In the main result the group G is quasiprimitive or biquasiprimitive on the vertices of Γ, and we obtain a genuine reduction to the case where G is a nonabelian simple group. Using normal quotient techniques developed by the first author, the main theorem applies to general G-...
متن کاملVertex-transitive CIS graphs
A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and vertex-transitive if, for every pair of vertices, there exists an automorphism of the graph mapping one to the other. We show that a vertex-transitive graph is CIS if and o...
متن کامل4-Factor-Criticality of Vertex-Transitive Graphs
A graph of order n is p-factor-critical, where p is an integer of the same parity as n, if the removal of any set of p vertices results in a graph with a perfect matching. 1-factor-critical graphs and 2-factor-critical graphs are well-known factor-critical graphs and bicritical graphs, respectively. It is known that if a connected vertextransitive graph has odd order, then it is factor-critical...
متن کاملGroup amalgams of index (4, 2) and 4-valent 2-arc-transitive graphs
A finite group amalgam of index (k,m) is a 5-tuple (L,φ,B, ψ,R) where L, B, and R are finite groups, φ : B → L and ψ : B → R are monomorphisms, and the indices of B and B in L and R are k and m, respectively. The amalgam is faithful if N ≤ B, N C L, and N C R implies N = 1. It is well known that the finite faithful amalgams of index (k, 2) are in a bijective correspondence with (the conjugacy c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2015
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2014.10.002